#include<bits/stdc++.h>
#define ll long long
#define mid ((l+r)>>1)
using namespace std;
namespace IO{
    char buff[1<<21],*p1=buff,*p2=buff;
    char getch(){
        return p1==p2&&(p2=((p1=buff)+fread(buff,1,1<<21,stdin)),p1==p2)?EOF:*p1++;
    }
    template<typename T>
    void read(T &x){
        char ch=getch();int fl=1;x=0;
        while(ch>'9'||ch<'0'){if(ch=='-')fl=-1;ch=getch();}
        while(ch<='9'&&ch>='0'){x=x*10+ch-48;ch=getch();}
        x*=fl;
    }
    template<typename T,typename ...Args>
    void read(T &x,Args& ...args){
        read(x);read(args...);
    }
    char obuf[1<<21],*p3=obuf;
    void putch(char ch){
        if(p3-obuf<(1<<21))*p3++=ch;
        else fwrite(obuf,p3-obuf,1,stdout),p3=obuf,*p3++=ch;
    }
    void pc(const char *s){
    	while(*s)putch(*s),s++;
    }
    char ch[100];
    template<typename T>
    void write(T x){
        if(!x)return putch('0');
        if(x<0)putch('-'),x*=-1;
        int top=0;
        while(x)ch[++top]=x%10+48,x/=10;
        while(top)putch(ch[top]),top--;
    }
    template<typename T,typename ...Args>
    void write(T x,Args ...args){
        write(x),putch(' '),write(args...);
    }
    void flush(){fwrite(obuf,p3-obuf,1,stdout);}
}
using namespace IO;
const int N=2e5+5,mod=998244353;
const __int128 Inf=2e15;
inline int Mod(int x){return x>=mod?x-mod:x;}
int n;
int a[N],b[N],c[N];
struct node{
	__int128 l,len,k,b;
};
inline __int128 ask(vector<node>&f){
	__int128 ans=0;
	for(auto now:f)
		if(now.l<=0)ans=max(ans,now.b);
	return ans;
}
vector<node>f,g;
signed main(){
	freopen("b.in","r",stdin);
//	freopen("b.out","w",stdout);
	read(n); 
	for(int i=1;i<=n;i++)read(a[i]);
	for(int i=1;i<=n;i++)read(b[i]);
	for(int i=1;i<n;i++)read(c[i]);
	f.push_back({0,1,a[n],(__int128)a[n]*b[n]});
	for(int i=n-1;i>=1;i--){
		g.clear();
		g.push_back({0,1,a[i],ask(f)});
		for(auto now:f){
			node nxt;
			nxt.l=(__int128)c[i]*now.l-b[i];
			nxt.len=min((__int128)c[i]*now.len,Inf);
			nxt.k=now.k;
			nxt.b+=(__int128)a[i]*b[i];
			cerr<<(ll)nxt.l<<','<<(ll)nxt.len<<'/'<<(ll)nxt.k<<' '<<(ll)nxt.b<<'\n';
			if(nxt.l<0){
				ll s=(-nxt.l)/nxt.len;
				nxt.l+=(__int128)s*nxt.len;
				nxt.b+=(__int128)s*nxt.k;
			}
			if(nxt.l>2e24)continue;
			g.push_back(nxt);
		}
		swap(f,g);
		cerr<<i<<":\n";
		for(auto nxt:f){
			cerr<<(ll)nxt.l<<','<<(ll)nxt.len<<'/'<<(ll)nxt.k<<' '<<(ll)nxt.b<<'\n';
		}
	}
	write(ask(f)%mod);
	return flush(),0;
}
